Accurate Computations with Collocation and Wronskian Matrices of Jacobi Polynomials
نویسندگان
چکیده
In this paper an accurate method to construct the bidiagonal factorization of collocation and Wronskian matrices Jacobi polynomials is obtained used compute with high relative accuracy their eigenvalues, singular values inverses. The particular cases Legendre polynomials, Gegenbauer Chebyshev first second kind rational are considered. Numerical examples included.
منابع مشابه
Complexity of Computations with Matrices and Polynomials
We review the complexity of polynomial and matrix computations, as well as their various correlations to each other and some major techniques for the design of algebraic and numerical algorithms. Polynomial and matrix computations are highly important classical subjects. They have been thoroughly revised during the last decades due to the development of computer technology, whose latest notable...
متن کاملComputations with quasiseparable polynomials and matrices
In this paper we survey several recent results that highlight an interplay between a relatively new class of quasiseparable matrices and polynomials. Quasiseparable matrices generalize two classical matrix classes, Jacobi (tridiagonal) matrices and unitary Hessenberg matrices that are known to correspond to real orthogonal polynomials and Szegö polynomials, resp. The latter two polynomial famil...
متن کاملComputations with quasiseparable polynomials and matrices
An interplay between polynomials and dense structured matrices is a classical topic. The structure of these dense matrices is understood in the sense that their n2 entries can be “compressed” to a smaller number O(n) of parameters. Operating directly on these parameters allows one to design efficient fast algorithms for these matrices and for the related applied problems. In the past decades ma...
متن کاملAccurate computations with Said-Ball-Vandermonde matrices
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0, 1), then those matrices are strictly totally positive. An algorithm for computing the bidiagonal decomposition of those Said-Ball-Vandermonde matrices is presented, which allows to use known algorithms for totally positive mat...
متن کاملAccurate Computations with Totally Nonnegative Matrices
Is it possible to perform numerical linear algebra with structured matrices to high relative accuracy at a reasonable cost? In our talk we answer this question affirmatively for a class of structured matrices whose applications range from approximation theory to combinatorics to multivariate statistical analysis [1, 2, 4]—the Totally Nonnegative (TN) matrices, i.e. matrices all of whose minors ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scientific Computing
سال: 2021
ISSN: ['1573-7691', '0885-7474']
DOI: https://doi.org/10.1007/s10915-021-01500-4